1·For example, implement merge sort.
例如，如何实现合并排序。
2·Let's run merge sort on it, and then we'll look at the code.
让我们在这个列表上运行归并排序，然后我们在看一下代码。
3·20 minutes: Coding question. For example, implement merge sort.
接下来的20分钟：编程的问题。例如，如何实现合并排序。
4·Merge sort has o (n log n) worst-case and average-case performance.
合并排序的最差性能和平均性能为o (n log n)。
5·It is easy to understand the concept of 2-way merge sort algorithms.
二路归并排序算法的思想比较容易理解。
6·Let's do selection and let's do merge sort here on the right just to see what actually happens.
中间进行选择排序，右边进行归并排序，看看会发生什么。
7·Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。
8·Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.
Emad Omara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
9·Use merge sort, in a binary search algorithm complexity: nlogn, n number two together, if can equal to a specific number m, the output yes, otherwise no output.
说明：运用归并排序，在用二分法查找，算法复杂度：nlogn，n个数两两相加，若能等于特定数m，则输出yes，否则输出no。
10·Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.
在这些上面再运行归并排序，根据归纳，如果这样是正确的，我将重新得到两个列表，然后我会把它们合并在一起。